Solving Problems by Formula Manipulation in Logic and Linear Inequalities

نویسنده

  • Louis Hodes
چکیده

Using formal logic, many iproblems from the general area of linear inequalities co~ be expressed in the elementary theory o f addition on the real numbers (EAR). We describe a method for eliminatit~ quantiflers in EAR which has been programmed arm demonstrate its usefulness in solving some problems related to linear programming. In the area o f mechanical mathematics this kind o f approach has been neglected in favor o f more generalized method r based on Herbrand expansion. However, in a restricted area, such as linear inequalities, the use o f these ~pecialized methods can increaye e.O~cieney by several orders of maonitud~ over an axiomatic Herbrand approach, aJut make practical problems accessible. As is common in a~ificial intelligence, the work reported here is of an interdisciplinary nature. It involves mathematical logic, linear inequalities, and symbolic mathematics on a computer. For the sake of a~gument, let us distinguish two kinds of workers in the area of linear inequalities. There is the theoretician, who is developing new methods and discovering new theorems. Then there is the user, who is faced with a practical problem which can be expressed in sorae way at least piecewise linearly. As a simple-minded distinction between the theoretician and the user we can say that the latter is interested in questions involving a fixed number of variables,, while the former is concerned with questions involving an arbitrary number of variables. Using terminology from iogie to be made more precise below ~this means that the ,•ser is generally working within the elementary J~eory of additi<m on the reals while the ~Lheoretician is generally working on a higher level. * This is a revised version of a paper pres+;nted at the Inter~mional Joint Confe]x'm-e on Artificial Intelligence, London, September 1971. Artificial Intelligenee 3 (1972), 165--i74 Copyright ~) 1972 by North-Holland Publishing Company

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new heuristic approach to solve product mix problems in a multi-bottleneck system

Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...

متن کامل

A new variant of the Zhang neural network for solving online time-varying linear inequalities

Since March 2001, a special class of recurrent neural networks termed the Zhang neural network (ZNN) has been proposed by Zhang and co-workers for solving online a rich repertoire of time-varying problems. By extending Zhang et al.’s design formula (or say, the ZNN design formula), a (new) variant of the ZNN design formula is proposed and investigated in this paper, which is also based on a mat...

متن کامل

Solving Disjunctive Constraints for Interactive Graphical Applications

In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortunately, disjunctions are typically not handled by constraint solvers that support direct manipulation, in part because solving such problems is NP-hard. We show here that is in fact possible to (re-)solve systems of d...

متن کامل

Solving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function

Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

متن کامل

Solving Path Following Problem for Car-Like Robot in the Presence of Sliding Effect via LMI Formulation

One of the main problems of car-like robot is robust path following in the presence of sliding effect. To tackle this problem, a robust mix H2/H∞ static state feedback control method is selected. This method is the well-known linear robust controller which is robust against external disturbance as well as model uncertainty. In this paper, the path following problem is formulated as linear matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1971